全文获取类型
收费全文 | 5073篇 |
免费 | 417篇 |
国内免费 | 325篇 |
专业分类
化学 | 203篇 |
晶体学 | 2篇 |
力学 | 26篇 |
综合类 | 139篇 |
数学 | 5192篇 |
物理学 | 253篇 |
出版年
2024年 | 10篇 |
2023年 | 97篇 |
2022年 | 139篇 |
2021年 | 126篇 |
2020年 | 196篇 |
2019年 | 224篇 |
2018年 | 214篇 |
2017年 | 198篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 173篇 |
2013年 | 437篇 |
2012年 | 189篇 |
2011年 | 294篇 |
2010年 | 295篇 |
2009年 | 435篇 |
2008年 | 377篇 |
2007年 | 270篇 |
2006年 | 311篇 |
2005年 | 213篇 |
2004年 | 196篇 |
2003年 | 167篇 |
2002年 | 161篇 |
2001年 | 150篇 |
2000年 | 139篇 |
1999年 | 135篇 |
1998年 | 89篇 |
1997年 | 60篇 |
1996年 | 44篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 27篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5815条查询结果,搜索用时 15 毫秒
991.
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular. In this work, all connected bicyclic graphs with exactly two main eigenvalues are determined. 相似文献
992.
Norbert Polat 《Discrete Mathematics》2009,309(8):2119-2133
A graph G has the Median Cycle Property (MCP) if every triple (u0,u1,u2) of vertices of G admits a unique median or a unique median cycle, that is a gated cycle C of G such that for all i,j,k∈{0,1,2}, if xi is the gate of ui in C, then: {xi,xj}⊆IG(ui,uj) if i≠j, and dG(xi,xj)<dG(xi,xk)+dG(xk,xj). We prove that a netlike partial cube has the MCP if and only if it contains no triple of convex cycles pairwise having an edge in common and intersecting in a single vertex. Moreover a finite netlike partial cube G has the MCP if and only if G can be obtained from a set of even cycles and hypercubes by successive gated amalgamations, and equivalently, if and only if G can be obtained from K1 by a sequence of special expansions. We also show that the geodesic interval space of a netlike partial cube having the MCP is a Pash-Peano space (i.e. a closed join space). 相似文献
993.
Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265-272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85; R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum); M. Hofmeister, Graph covering projections arising from finite vector spaces over finite fields, Discrete Math. 143 (1995) 87-97; M. Hofmeister, Enumeration of concrete regular covering projections, SIAM J. Discrete Math. 8 (1995) 51-61; M. Hofmeister, A note on counting connected graph covering projections, SIAM J. Discrete Math. 11 (1998) 286-292; J.H. Kwak, J. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273-285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747-761]). A covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. A covering p from a Cayley graph onto another Cay (Q,Y) is called typical if the map p:A→Q on the vertex sets is a group epimorphism. Recently, the isomorphism classes of connected typical circulant r-fold coverings of a circulant graph are enumerated in [R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85] for r=2 and in [R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum)] for any r. As a continuation of these works, we enumerate in this paper the isomorphism classes of typical abelian prime-fold coverings of a circulant graph. 相似文献
994.
Alexandre Pinlou 《Discrete Mathematics》2009,309(8):2108-128
An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that every oriented graph with a maximum average degree less than and girth at least 5 has an oriented chromatic number at most 16. This implies that every oriented planar graph with girth at least 5 has an oriented chromatic number at most 16, that improves the previous known bound of 19 due to Borodin et al. [O.V. Borodin, A.V. Kostochka, J. Nešet?il, A. Raspaud, É. Sopena, On the maximum average degree and the oriented chromatic number of a graph, Discrete Math. 206 (1999) 77-89]. 相似文献
995.
On graphs whose square have strong hamiltonian properties 总被引:1,自引:0,他引:1
The squareG2 of a graph G is the graph having the same vertex set as G and two vertices are adjacent if and only if they are at distance at most 2 from each other. It is known that if G has no cut-vertex, then G2 is Hamilton-connected (see [G. Chartrand, A.M. Hobbs, H.A. Jung, S.F. Kapoor, C.St.J.A. Nash-Williams, The square of a block is hamiltonian connected, J. Combin. Theory Ser. B 16 (1974) 290-292; R.J. Faudree and R.H. Schelp, The square of a block is strongly path connected, J. Combin. Theory Ser. B 20 (1976) 47-61]). We prove that if G has only one cut-vertex, then G2 is Hamilton-connected. In the case that G has only two cut-vertices, we prove that if the block that contains the two cut-vertices is hamiltonian, then G2 is Hamilton-connected. Further, we characterize all graphs with at most one cycle having Hamilton-connected square. 相似文献
996.
Akira Saito 《Discrete Mathematics》2009,309(16):5000-1723
We consider 2-factors with a bounded number of components in the n-times iterated line graph Ln(G). We first give a characterization of graph G such that Ln(G) has a 2-factor containing at most k components, based on the existence of a certain type of subgraph in G. This generalizes the main result of [L. Xiong, Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422]. We use this result to show that the minimum number of components of 2-factors in the iterated line graphs Ln(G) is stable under the closure operation on a claw-free graph G. This extends results in [Z. Ryjá?ek, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997) 217-224; Z. Ryjá?ek, A. Saito, R.H. Schelp, Closure, 2-factors and cycle coverings in claw-free graphs, J. Graph Theory 32 (1999) 109-117; L. Xiong, Z. Ryjá?ek, H.J. Broersma, On stability of the hamiltonian index under contractions and closures, J. Graph Theory 49 (2005) 104-115]. 相似文献
997.
An infinite class of new binary linear completely transitive (and so, completely regular) codes is given. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes in the constructed class with d=3, covering radius ρ and lengths and , respectively. The corresponding distance-transitive graphs, which can be defined as coset graphs of these completely transitive codes are described. 相似文献
998.
The paper deals with the study of Fredholm property and essential spectrum of general difference (or band) operators acting on the spaces l p (X) on a discrete metric space X periodic with respect to the action of a finitely generated discrete group. The Schrödinger operator on a combinatorial periodic graph is a prominent example of a band operator of this kind. 相似文献
999.
G. R. Omidi 《Graphs and Combinatorics》2009,25(1):111-114
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. We obtain some lower bounds for the nullity
of graphs and we then find the nullity of bipartite graphs with no cycle of length a multiple of 4 as a subgraph. Among bipartite
graphs on n vertices, the star has the greatest nullity (equal to n − 2). We generalize this by showing that among bipartite graphs with n vertices, e edges and maximum degree Δ which do not have any cycle of length a multiple of 4 as a subgraph, the greatest nullity is .
G. R. Omidi: This research was in part supported by a grant from IPM (No.87050016). 相似文献
1000.
周长为3的m限制边割连通图 总被引:1,自引:1,他引:0
如果连通图的G存在边割S,使得G-S的每一个连通分支都含有至少m个顶点,则称图G是m限制边连通的.本文刻画了周长为3的m限制边连通图. 相似文献